1392F - Omkar and Landslide - CodeForces Solution


binary search constructive algorithms data structures greedy math *2400

Please click on ads to support us..

C++ Code:

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

int main(){
    ios_base::sync_with_stdio(0), cin.tie(0);
    ll n;
    cin >> n;
    ll s = 0;
    for (ll x, i = 0; i < n; ++i) {
        cin >> x;
        s += x;
        s -= i;
    }
    ll base = s / n;
    ll xtra = s % n;
    for (ll i = 0; i < n; ++i) {
        ll h = base + i;
        if (xtra > 0) {
            ++h;
            --xtra;
        }
        cout << h << ' ';
    }
    cout << '\n';
    return 0;
}


Comments

Submit
0 Comments
More Questions

1335A - Candies and Two Sisters
96B - Lucky Numbers (easy)
1151B - Dima and a Bad XOR
1435B - A New Technique
1633A - Div 7
268A - Games
1062B - Math
1294C - Product of Three Numbers
749A - Bachgold Problem
1486B - Eastern Exhibition
1363A - Odd Selection
131B - Opposites Attract
490C - Hacking Cypher
158B - Taxi
41C - Email address
1373D - Maximum Sum on Even Positions
1574C - Slay the Dragon
621A - Wet Shark and Odd and Even
1395A - Boboniu Likes to Color Balls
1637C - Andrew and Stones
1334B - Middle Class
260C - Balls and Boxes
1554A - Cherry
11B - Jumping Jack
716A - Crazy Computer
644A - Parliament of Berland
1657C - Bracket Sequence Deletion
1657B - XY Sequence
1009A - Game Shopping
1657A - Integer Moves